A Complete Axiomatisation for Timed Automata

A proof system of timed bisimulation equivalence for timed automata is presented, based on a CCS-style regular language for describing timed automata. It consists of the standard monoid laws for bisimulation and a set of inference rules. The judgments of the proof system are conditional equations of the form t = u where is a clock constraint and t, u are terms denoting timed automata. The proof of the completeness result relies on the notion of symbolic timed bisimulation, adapted from the work on value{passing processes.